The number of {1243, 2134}-avoiding permutations
نویسندگان
چکیده
We show that the counting sequence for permutations avoiding both of (classical) patterns 1243 and 2134 has algebraic generating function supplied by Vaclav Kotesovec A164651 in The On-Line Encyclopedia Integer Sequences.
منابع مشابه
On the Number of Permutations Avoiding a
Let 2 S k and 2 S n be permutations. We say contains if there exist 1 x 1 < x 2 < : : : < x k n such that (x i) < (x j) if and only if (i) < (j). If does not contain we say avoids. Let F (n;) = jf 2 S n j avoids gj. Stanley and Wilf conjectured that for any 2 S k there exists a constant c = c() such that F (n;) c n for all n. Here we prove the following weaker statement: For every xed 2 S k , F...
متن کاملNumber of cycles in the graph of 312-avoiding permutations
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. However, instead of requiring the tail of one permutation to equal the head of another for them to be connected by an edge, we require that the head and tail in question have their letters appear in the same order of size. We give a formula for the number of cycles of length d in th...
متن کاملOn the Number of Permutations Avoiding a Given Pattern
Let σ ∈ Sk and τ ∈ Sn be permutations. We say τ contains σ if there exist 1 ≤ x1 < x2 < . . . < xk ≤ n such that τ(xi) < τ(xj) if and only if σ(i) < σ(j). If τ does not contain σ we say τ avoids σ. Let F (n, σ) = |{τ ∈ Sn| τ avoids σ}|. Stanley and Wilf conjectured that for any σ ∈ Sk there exists a constant c = c(σ) such that F (n, σ) ≤ cn for all n. Here we prove the following weaker statemen...
متن کاملPermutations avoiding an increasing number of length-increasing forbidden subsequences
A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...
متن کاملThe Fine Structure of 321 Avoiding Permutations. the Fine Structure of 321 Avoiding Permutations
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in enumerating permutations which have a block structure avoiding 321, and whose blocks also have such structure (recursively). Generalizations of these results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics & Theoretical Computer Science
سال: 2023
ISSN: ['1365-8050', '1462-7264']
DOI: https://doi.org/10.46298/dmtcs.5287